/*
 * Copyright 2003,2016 BitMover, Inc
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

typedef	struct RBtree RBtree;
RBtree	*RBtree_new(int size, int (*compare)(void *a, void *b));
void	RBtree_free(RBtree *t);
void	*RBtree_first(RBtree *t);
void	*RBtree_last(RBtree *t);
void	*RBtree_find(RBtree *t, void *data);
void	*RBtree_next(RBtree *t, void *data);
void	*RBtree_prev(RBtree *t, void *data);
void	RBtree_insert(RBtree *t, void *data);
void	RBtree_delete(RBtree *t, void *data);
